Statistical analyses of cyclic and starlike hierarchical dominances in directed graphs
نویسندگان
چکیده
منابع مشابه
Cyclic Leveling of Directed Graphs
The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, leveling, crossing reduction, and coordinate assignment. However, there are situations where cycles must be displayed as such, e. g., distinguished cycles in the biosciences and processes that repeat in a daily or weekly turn. ...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملCyclic Connectivity Classes of Directed Graphs
We show that most connectivity types of simple directed graphs defined by A. Ádám in [1] are nonempty. The nonexistence of the three types that remain missing is the consequence of a fairly plausible conjecture, stated at the end of this paper. Introduction This paper gives an almost complete answer to a question raised by A. Ádám in [1] concerning the connectivity types of simple directed grap...
متن کاملHierarchical alignment of weighted directed acyclic graphs
In some applications of matching, the structural or hierarchical properties of the two graphs being aligned must be maintained. The hierarchical properties are induced by the direction of the edges in the two directed graphs. These structural relationships defined by the hierarchy in the graphs act as a constraint on the alignment. In this paper, we formalize this problem as the weighted alignm...
متن کاملA 2.5D Hierarchical Drawing of Directed Graphs
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes and into k ≥ 2 subsets, called walls, and also drawn in parallel planes. The planes of set of the walls are perpendicular to the planes of the layers. We present a method for computing such layouts and introduce five a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2019
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.100.032301